72,219 research outputs found
A genetic algorithm for the design of a fuzzy controller for active queue management
Active queue management (AQM) policies are those
policies of router queue management that allow for the detection of network congestion, the notification of such occurrences to the
hosts on the network borders, and the adoption of a suitable control
policy. This paper proposes the adoption of a fuzzy proportional
integral (FPI) controller as an active queue manager for Internet
routers. The analytical design of the proposed FPI controller is
carried out in analogy with a proportional integral (PI) controller,
which recently has been proposed for AQM. A genetic algorithm is
proposed for tuning of the FPI controller parameters with respect
to optimal disturbance rejection. In the paper the FPI controller
design metodology is described and the results of the comparison
with random early detection (RED), tail drop, and PI controller
are presented
A duality model of TCP and queue management algorithms
We propose a duality model of end-to-end congestion control and apply it to understanding the equilibrium properties of TCP and active queue management schemes. The basic idea is to regard source rates as primal variables and congestion measures as dual variables, and congestion control as a distributed primal-dual algorithm over the Internet to maximize aggregate utility subject to capacity constraints. The primal iteration is carried out by TCP algorithms such as Reno or Vegas, and the dual iteration is carried out by queue management algorithms such as DropTail, RED or REM. We present these algorithms and their generalizations, derive their utility functions, and study their interaction
Performance Comparison of Queue Management Algorithms in LTE Networks using NS-3 Simulator
One of the most important issues accepted by researchers in LTE cellular systems is to develop Queue Management Algorithms for RLC (Radio Link Control). The performance of queue-management algorithms depends on parameters such as latency, packet dropping, and bandwidth usage. Simulation software is used to evaluate the queue-management algorithms developed and to test their performance. In the literature, active queue management algorithms have been compared with wired and wireless networks. In contrast to prior works, in this study, we have analyzed active queue management algorithms using the LTE model in the NS-3 network simulator. When the data and the results obtained from the simulations have been evaluated, it is concluded that the RED algorithm using probabilistic methods and the threshold value is more successful than the other algorithms in LTE networks
Active Queue Management for Fair Resource Allocation in Wireless Networks
This paper investigates the interaction between end-to-end flow control and MAC-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a common access point; each user suffers fading, and a scheduler allocates the channel based on channel quality,but subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport layer flow control of TCP New Reno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender by setting the TCP receiver's advertised window limit, and this allows the scheduler to allocate bandwidth fairly between the users
CA-AQM: Channel-Aware Active Queue Management for Wireless Networks
In a wireless network, data transmission suffers from varied signal strengths and channel bit error rates. To ensure successful packet reception under different channel conditions, automatic bit rate control schemes are implemented to adjust the transmission bit rates based on the perceived channel conditions. This leads to a wireless network with diverse bit rates. On the other hand, TCP is unaware of such {\em rate diversity} when it performs flow rate control in wireless networks. Experiments show that the throughput of flows in a wireless network are driven by the one with the lowest bit rate, (i.e., the one with the worst channel condition). This does not only lead to low channel utilization, but also fluctuated performance for all flows independent of their individual channel conditions.
To address this problem, we conduct an optimization-based analytical study of such behavior of TCP. Based on this optimization framework, we present a joint flow control and active queue management solution. The presented channel-aware active queue management (CA-AQM) provides congestion signals for flow control not only based on the queue length but also the channel condition and the transmission bit rate. Theoretical analysis shows that our solution isolates the performance of individual flows with diverse bit rates. Further, it stabilizes the queue lengths and provides a time-fair channel allocation. Test-bed experiments validate our theoretical claims over a multi-rate wireless network testbed
Control design of a nonlinear controller to stabilize the nonlinear TCP model
This article presents the design of a highly efficient nonlinear0 controller which is a kind of an Active Queue Management (AQM) scheme to stabilize the nonlinear TCP model dynamics. Specific boundary conditions have beenconsidered for stability occurrences and have been compared with other existing Active Queue Management Schemes. All analytical experiments have been carried out using MATLAB
Managing network congestion with a Kohonen-based RED queue
The behaviour of the TCP AIMD algorithm is known to cause queue length
oscillations when congestion occurs at a router output link. Indeed, due to
these queueing variations, end-to-end applications experience large delay
jitter. Many studies have proposed efficient Active Queue Management (AQM)
mechanisms in order to reduce queue oscillations and stabilize the queue
length. These AQM are mostly improvements of the Random Early Detection (RED)
model. Unfortunately, these enhancements do not react in a similar manner for
various network conditions and are strongly sensitive to their initial setting
parameters. Although this paper proposes a solution to overcome the
difficulties of setting these parameters by using a Kohonen neural network
model, another goal of this study is to investigate whether cognitive
intelligence could be placed in the core network to solve such stability
problem. In our context, we use results from the neural network area to
demonstrate that our proposal, named Kohonen-RED (KRED), enables a stable queue
length without complex parameters setting and passive measurements.Comment: 8 pages, 9 figure
- …